Distributed persistent stores
نویسندگان
چکیده
Considerable effort has been expended over the last decade on the production of persistent stores, for example CMS POMS, CPOMS, MONADS and Thatte's Persistent Memory. These generally did not provide for concurrent access to the store, and included no support for distribution. In this paper we investigate the distribution of persistent stores, including the issues of uniformity, unbounded size, and stability. We then examine and contrast two examples of distributed persistent stores, the Monads DSM and distributed Napier.
منابع مشابه
EAR LY DRA FT Efficient caching in distributed persistent stores
This article shows how techniques from hardware systems like multiprocessor computers can be used to improve the efficiency of distributed software, such as distributed persistent stores. It also describes the practical implementation of a particular caching protocol for a distributed store.
متن کاملAn evaluation of efficient caching models for distributed persistent stores
This article is an evaluation of how caching-techniques from multiprocessor computers, can be used to improve the efficiency of distributed software, such as distributed persistent stores. It also describes the practical implementation of the weak cache consistency model in a distributed persistent store and presents a practical evaluation of this model compared to the sequential consistency mo...
متن کاملHigher-order Distributed Computation over Autonomous Persistent Stores
The traditional approach for building distributed applications is by calling a procedure in another store using an RPC mechanism. However, an RPC requires a round-trip network delay for every call and makes each store dependent on the availability of other stores. A solution to this problem is to migrate the remote objects needed to the client store, and in particular the remote procedures them...
متن کاملGarbage Collecting Persistent Object Stores
Many techniques have been devised for garbage collecting main memory heaps for programming languages, and there has more recently been progress on distributed garbage collection, for sets of long-lived processes in distributed systems. Little attention has been paid to garbage collecting large persistent stores, however. A persistent store is essentially a shared heap that outlives the executio...
متن کاملA Scalable Model of Distribution Promoting Autonomy of and Cooperation between PJava Object Stores
Distributed persistent systems often provide transparency of distribution at the cost of autonomy of object stores, efficiency of cooperation between them and scalability of the system. We propose a flexible model of distribution to support scalable persistent application systems that allows for both autonomous stores with low-cost, limited commitments to other stores and sophisticated models o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Microprocessors and Microsystems - Embedded Hardware Design
دوره 17 شماره
صفحات -
تاریخ انتشار 1993